On a Possible Continuous Analogue of the Szpilrajn Theorem and its Strengthening by Dushnik and Miller

نویسندگان

  • Gianni Bosi
  • Gerhard Herden
چکیده

The Szpilrajn theorem and its strengthening by Dushnik and Miller belong to the most quoted theorems in many fields of pure and applied mathematics as, for instance, order theory, mathematical logic, computer sciences, mathematical social sciences, mathematical economics, computability theory and fuzzy mathematics. The Szpilrajn theorem states that every partial order can be refined or extended to a total (linear) order. The theorem by Dushnik and Miller states, moreover, that every partial order is the intersection of its total (linear) refinements or extensions. Since in mathematical social sciences or, more general, in any theory that combines the concepts of topology and order one is mainly interested in continuous total orders or preorders in this paper some aspects of a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller will be discussed. In particular, necessary and sufficient conditions for a topological space to satisfy a possible continuous analogue of the Dushnik-Miller theorem will be presented. In addition, it will be proved that a continuous analogue of the Szpilrajn theorem does not hold in general. Further, necessary and in some cases necessary and sufficient conditions for a topological space to satisfy a possible continuous analogue of the Szpilrajn theorem will be presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On self-embeddings of computable linear orderings

The Dushnik–Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine computability-theoretical aspects of this classical theorem.

متن کامل

The Proof-theoretic Strength of the Dushnik-miller Theorem for Countable Linear Orders

We show that the Dushnik-Miller Theorem for countable linear order-ings (stating that any countable linear ordering has a nontrivial self-embedding) is equivalent (over recursive comprehension (RCA 0)) to arithmetic comprehension (ACA 0). This paper presents a result in reverse mathematics, a program initiated by H. Friedman and S. Simpson, trying to determine the weakest possible \set-theoreti...

متن کامل

Fixed point theorem for non-self mappings and its applications in the modular ‎space

‎In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...

متن کامل

Dushnik-Miller dimension of TD-Delaunay complexes

TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function [5]. In [2] the authors noticed that every triangulation is the TD-Delaunay graph of a set of points in R, and conversely every TD-Delaunay graph is planar. It seems natural to study the generalization of this property in higher d...

متن کامل

The Basic Theorem and its Consequences

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Order

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2006